Bounded fragment and hybrid logic with polyadic modalities
نویسنده
چکیده
We show that the bounded fragment of first order logic and the hybrid language with ‘downarrow’ and ‘at’ operators are equally expressive even with polyadic modalities, but that their ‘positive’ fragments are equally expressive only for unary modalities.
منابع مشابه
The Bounded Fragment and Hybrid Logic with Polyadic Modalities
We show that the bounded fragment of first-order logic and the hybrid language with ‘downarrow’ and ‘at’ operators are equally expressive even with polyadic modalities, but that their ‘positive’ fragments are equally expressive only for unary modalities. §
متن کاملSahlqvist Formulas in Hybrid Polyadic Modal Logics
Building on a new approach to polyadic modal languages and Sahlqvist formulas introduced in [10] we define Sahlqvist formulas in hybrid polyadic modal languages containing nominals and universal modality or satisfaction operators. Particularly interesting is the case of reversive polyadic languages, closed under all ‘inverses’ of polyadic modalities because the minimal valuations arising in the...
متن کاملFragments of Fixpoint Logic on Data Words
We study fragments of a μ-calculus over data words whose primary modalities are ‘go to next position’ (Xg), ‘go to previous position’ (Yg), ‘go to next position with the same data value’ (Xc), ‘go to previous position with the same data value (Yc)’. Our focus is on two fragments that are called the bounded mode alternation fragment (BMA) and the bounded reversal fragment (BR). BMA is the fragme...
متن کاملAlgorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
In Conradie, Goranko, and Vakarelov (2006, Logical Methods in Computer Science, 2) we introduced a new algorithm, SQEMA, for computing first-order equivalents and proving the canonicity of modal formulae of the basic modal language. Here we extend SQEMA, first to arbitrary and reversive polyadic modal languages, and then to hybrid polyadic languages too. We present the algorithm, illustrate it ...
متن کاملExistential second-order logic and modal logic with quantified accessibility relations
This article investigates the role of arity of second-order quantifiers in existential second-order logic, also known as Σ1. We identify fragments L of Σ1 where second-order quantification of relations of arity k > 1 is (nontrivially) vacuous in the sense that each formula of L can be translated to a formula of (a fragment of) monadic Σ1. Let polyadic Boolean modal logic with identity (PBML) be...
متن کامل